منابع مشابه
HYbrid Monitoring and Networks Simulation - HYMNS
This note is about some of the technical work that UCL CS people have done, partly Jon at HP during the first quarter of 1998, but also previous work using NS under several projects, notably MERCI, HIPAPRCH and DARPA work. The work described is a series of seperate efforts to add protocols to NS, and then a design effort to enhance NS to provide interworking between real and simulated (actual a...
متن کاملThe Psalms as Hymns in the Temple of Jerusalem
From as far back as our sources allow, hymns were part of Near Eastern temple ritual, with their performers an essential component of the temple functionaries. 1 These sources include Sumerian, Akkadian, and Egyptian texts from as early as the third millennium BCE. From the second millennium BCE, we gain further examples of hymns from the Hittite realm, even if most (if not all) of the poems ar...
متن کاملByzantine Fireflies
This paper addresses the problem of synchronous beeping, as addressed by swarms of fireflies. We present Byzantine-resilient algorithms ensuring that the correct processes eventually beep synchronously despite a subset of nodes beeping asynchronously. We assume that n > 2f (n is the number of processes and f is the number of Byzantine processes) and that the initial state of the processes can b...
متن کاملMaking Byzantine Fault Tolerant Systems Tolerate Byzantine Faults
This paper argues for a new approach to building Byzantine fault tolerant systems. We observe that although recently developed BFT state machine replication protocols are quite fast, they don’t actually tolerate Byzantine faults very well: a single faulty client or server is capable of rendering PBFT, Q/U, HQ, and Zyzzyva virtually unusable. In this paper, we (1) demonstrate that existing proto...
متن کاملExtending Binary Byzantine Agreement to Multivalued Byzantine Agreement
The concern of this paper is a set of potentially faulty processes that engage in a distributed computation to agree on some piece of information. Each process enters the computation with an initial value. The computation returns a common result value to each correct process. If all correct processes begin the computation with identical initial values, then the result value equals the initial v...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Journal of Theological Studies
سال: 1909
ISSN: 0022-5185,1477-4607
DOI: 10.1093/jts/os-x.39.465